基于蜂群算法多子阵电台天线波束形成

考虑到战场环境下,低信噪比和敌方干扰容易造成超短波电台通信中断,而鉴于天线阵可以有效提高信噪比和抑制干扰,结合战场电台天线分布特点,提出一种多子阵电台天线应急接收模型。理论分析多子阵电台天线波束形成特性,以消除栅瓣、抑制干扰、提高增益为目标,采用蜂群算法对子阵间距进行优化。仿真结果表明,优化子阵间距可以有效消除栅瓣、抑制干扰、提高增益。同时,与遗传算法和粒子群算法相比,蜂群算法具有更好的全局搜索能力和收敛速度。该研究成果可为超短波电台应急通信提供参考。     

基于改进遗传算法的油料调拨优化

为实现油料快速调拨运输，利用改进的遗传算法求解油料调拨优化问题，采用了一种受贪婪算法启发的新的交叉算子和变异算子，对比模拟退火算法等其他算法而言，具有较好的鲁棒性，能很好地解决油料调拨运输过程中多任务多地点的油料调拨运输问题。     

基于贝叶斯混合博弈的空袭火力资源分配决策模型

从博弈论的角度出发研究空袭火力资源的分配问题,针对空袭编队和防空火力单元攻防对抗过程中存在的不确定性、静态性以及动态性,建立基于贝叶斯混合博弈的空袭对抗火力分配模型。通过构造贝叶斯混合博弈树,采用逆向回溯法分别建立不同的博弈分析模型,利用混合粒子群算法求解那什均衡。仿真结果表明:以博弈论为背景研究空袭作战火力分配问题,符合真实的作战坏境,有效性好,有较高的理论应用价值。     

弹丸速度的数字化激光幕测试技术

针对传统弹丸速度测量方法的局限，提出一种新的弹丸速度测试技术——数字化激光幕结合互相关速度测量算法的测试技术，并给出了激光总体测速方案、测速原理以及互相关测速方法，经靶场试验验证测试效果良好。     

Technical note: Finite-time regret analysis of Kiefer-Wolfowitz stochastic approximation algorithm and nonparametric multi-product dynamic pricing with unknown demand

We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ₁, κ₂ are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature.     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

Value management of diagnostic equipment with cancelation,no‐show,and emergency patients

Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016     

武器装备体系能力矩阵评估方法

针对武器装备体系能力难以客观、定量评估的问题,引入复杂网络理论,提出了基于矩阵运算的武器装备体系能力评估方法。分析了武器装备体系能力的概念,建立了武器装备体系的复杂层次网络模型,描述了装备网络的组成、运行过程,定义了装备网络的矩阵描述方法和矩阵运算规则,提出了装备网络作战能力描述参数,给出了装备网络能力的矩阵计算方法,进行了影响因素分析,最后通过实例验证了方法可行性、有效性和灵活性。     

基于IMM滤波器的纯方位机动目标跟踪

针对无源纯方位跟踪中目标机动的问题,提出了一种基于交互式多模型的目标跟踪算法。该算法用伪量测变换估计器(PLE)将纯方位跟踪中非线性观测模型线性化,避免了计算雅克比行列式。机动目标跟踪中通过实时调整模型匹配概率,提高了滤波器对状态变化的跟踪能力。同时该算法实时修正观测噪声协方差,消除目标远离基阵时观测噪声对目标定位的影响。最后通过与MGEKF进行比较,Monte Carlo仿真结果验证了该算法的优越性。     

基于并行模拟的多核集群系统性能预测和分析

针对多核集群系统所表现出的新的性能特征,提出了面向多核集群系统消息传递应用程序的并行模拟模型并设计、实现了一个并行模拟器MCPSim(Multi-core Cluster Parallel Simulator),MCPSim在功能模型和性能模型上体现了片内核间、结点内片间以及结点间等三个层次上消息通信的特点,同时支持对应用的消息数量、通信量等的百分比分布的profiling功能,采用PRIMEJ、acobi3D、NPB IS以及HPL等Benchmark程序对MCPSim进行了测试,结果表明MCPSim性能预测的精度优于BigSim,同时能够广泛应用于针对多核集群系统消息传递应用程序的性能分析中。